| 1. | Figure 1 illustrates a hash chain before an element is removed
图1为删除一个元素之前的hash链： |
| 2. | Searches the appropriate hash chain for the desired key
它首先会在适当的hash链中搜索需要的键值。 |
| 3. | While that hash chain is being traversed . the fact that
Hash value是从对象中的值计算得来的一个数字。 |
| 4. | Eventually , the initial part of the hash chain ending in the removed element will be garbage collected
最终，原始hash链中被删除的元素将会被垃圾收集。 |
| 5. | As the number of elements in the map grows , the hash chains will grow longer and retrieval time will increase
随着map中元素数目的增长， hash链将会变长，因此检索时间也会增加。 |
| 6. | Operations are defined in the obvious way , traversing each hash chain and then moving on to the next chain until all the chains have been traversed
操作以一种明显的方式定义，即遍历每个链然后转到下一个链直到所有的链都被遍历。 |
| 7. | So once you have a reference into a hash chain , while you may not know whether you have a reference to the head of the list , you do know that the rest of the list will not change its structure
所以说只要有对某个hash链的一个引用，即使可能不知道有没有对列表头节点的引用，您也可以知道列表的其余部分的结构不会改变。 |
| 8. | Making reference to the thought of hash chain , a modification over traditional ocsp , client partially cached - ocsp , is proposed which can efficiently reduce not only the computation at the client and server side but also the band load
该方案可以有效减少客户端及服务器端的计算量以及减轻带宽负荷。最后在论文中还引入了ca信任路径构建的新思路。 |
| 9. | 3 a new group key management scheme based on a full and balanced tree scheme in conjunction with one - way hash chain is proposed . by comparison , we find that it has good performance of low re - key communication costs and scalable property
提出一种采用单向哈希链结合完全平衡树的分层密钥管理方法，比较表明它在密钥更新时通信次数较少，是一种高效的密钥管理方案。 |
| 10. | Because a thread could see stale values for the link pointers in a hash chain , simply removing an element from the chain would not be sufficient to ensure that other threads will not continue to see the removed value when performing a lookup
因为一个线程可能看到hash链中链接指针的过时的值，简单地从链中删除一个元素不足以保证其他线程在进行查找的时候不继续看到被删除的值。 |
